Parametric random generation of deterministic tree automata

Random Generation of Deterministic Tree (Walking) Automata

Random generation of possibly incomplete deterministic automata

This paper presents an efficient random generator, based on a Boltzmann sampler, for accessible, deterministic and possibly not complete automata. An intermediate result is that Θ(1) of accessible and deterministic automata are complete.

Random Generation of Nondeterministic Tree Automata

Algorithms for (nondeterministic) finite-state tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense that the number of states of an equivalent minimal deterministic finite-state tree automaton is extremely small....

Random Generation of Deterministic Acyclic Automata Using Markov Chains

In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches the uniform distribution on n-state such automata. We then show how to adapt this algorithm in order to generate minimal acyclic automata with n states almost uniformly.

Enumeration and random generation of possibly incomplete deterministic automata

This paper presents an efficient random generator, based on a Boltzmann sampler, for accessible, deterministic and possibly not complete automata. An interesting intermediate result is that for any finite alphabet, the proportion of complete automata with n states amongst deterministic and accessible ones is greater than a positive constant.